On triple-sum-sets and two or three weights codes
نویسندگان
چکیده
منابع مشابه
Linear codes with two or three weights from quadratic Bent functions
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...
متن کاملSets of double and triple weights of trees
Abstract. Let T be a weighted tree with n leaves numbered by the set {1, ..., n}. Let Di,j be the distance between the leaves i and j. Let Di,j,k = 1 2 (Di,j +Dj,k +Di,k). We will call such numbers “triple weights” of the tree. In this paper, we find necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an n-set to be the set of the triple weights of a tree with ...
متن کاملOn the Parameters of Codes with Two Homogeneous Weights
Delsarte showed that for any projective linear code over a finite field GF (p) with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = p u and w2 = p (u + 1). Moreover, he showed that the additive group of such a code has a strongly regular Cayley graph. Here we show that for any proper, regular, projective linear code C over a finite Frobenius ring with tw...
متن کاملLinear Codes With Two or Three Weights From Some Functions With Low Walsh Spectrum in Odd Characteristic
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights are obtained from some functions with low Walsh spectrum in odd characteristic. Numerical results show that some of the linear codes obtained are optimal or al...
متن کاملOn permutation sum sets
A permutation sum (resp. difference) set on a group G is a set F of bijections from G to G such that fg (resp. f−1g) is again a bijection for all f, g ∈ F (resp. f, g ∈ F with f 6= g ∈ S), where (fg)(x) := f(x)g(x) for all x ∈ G, etc. The maximum size d(G) of a permutation difference set has been well studied, with many connections drawn between such sets and combinatorial objects such as famil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90047-5